package DataStructureAndAlgorithm.AcWing_每日一题.数学.同余;

import java.util.Scanner;

//链接：https://www.acwing.com/problem/content/3803/
public class AcWing_3800 {
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int z = 0; z < t; z++){
            int b = in.nextInt();
            int k = in.nextInt();
            int sum = 0,last = 0;
            for (int i = 0; i < k; i++){
                int a = in.nextInt();
                sum += a;
                last = a;
            }

            int res = last % 2;
            if ((b & 1) == 1)res = sum % 2;
            if ((res & 1) == 1)System.out.println("odd");
            else System.out.println("even");
        }

        in.close();
    }
}
